منابع مشابه
On Hamiltonian Regular Graphs
In this paper we shall determine, when 1 = 6, bounds for numbers f(k, I) and F{k, 1) defined as follows: f{k, l)/F(k, I) is defined to be the smallest integer n for which there exists a regular graph/Hamiltonian regular graph of valency k and girth I having n vertices. The problem of determining minimal regular graphs of given girth was first considered by Tutte [9]. Bounds for f(k, I) have bee...
متن کاملOn hamiltonian Toeplitz graphs
In this paper we will consider hamiltonian properties of so-called Toeplitz graphs, which are defined as follows: Definition 1 Let n,m, a1, . . . , am ∈ N, 0 < a1 < · · · < am < n and V := {0, . . . , n− 1}. Define E := {[i, j] ∈ V 2 : ∃k ∈ {1, . . . , m} : |j − i| = ak}. Then the graph (V,E) with set of vertices V and set of edges E is called an undirected Toeplitz graph with entries (or strip...
متن کاملGraphs with Hamiltonian balls
For a vertex u of a graph G and an integer r, the ball of radius r centered at u is the subgraph Gr(u) induced by the set of all vertices of G whose distance from u does not exceed r. We investigate the set 1i of connected graphs G with at least 3 vertices such that every ball of radius 1 in G has a Hamilton cycle. We prove that every graph G in 1-£ with n vertices has at least 2n 3 edges, and ...
متن کاملHamiltonian double latin squares
A double latin square of order 2n on symbols s1;y; sn is a 2n 2n matrix A 1⁄4 ðaijÞ in which each aij is one of the symbols s1;y; sn and each sk occurs twice in each row and twice in each column. For k 1⁄4 1;y; n let BðA; skÞ be the bipartite graph with vertices r1;y; r2n; c1;y; c2n and 4n edges 1⁄2ri; cj corresponding to ordered pairs ði; jÞ such that aij 1⁄4 sk: We say that A is Hamiltonian i...
متن کاملOn pancyclism in hamiltonian graphs
We investigate the set of cycle lengths occurring in a hamiltonian graph with at least one or two vertices of large degree. We prove that in every case this set contains all the integers between 3 and some t, where t depends on the order of the graph and the degrees of vertices. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1978
ISSN: 0012-365X
DOI: 10.1016/0012-365x(78)90164-4